The Tower of Hanoi and Finite Automata
نویسنده
چکیده
Some of the algorithms for solving the Tower of Hanoi puzzle can be applied “with eyes closed” or “without memory”. Here we survey the solution for the classical tower of Hanoi that uses finite automata, as well as some variations on the original puzzle. In passing, we obtain a new result on morphisms generating the classical and the lazy tower of Hanoi, and a new result on auomatic sequences.
منابع مشابه
Shortest paths in the Tower of Hanoi graph and finite automata
Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computing the length of the shortest path. The key element is a finite-state machine which decides, after examining on the average only a small number of the largest discs (asymptotically, 63 38 ≈ 1.66), whether the largest disc will be moved once or twice. ...
متن کاملSchreier Spectrum of the Hanoi Towers Group on Three Pegs
Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are Schreier graphs of the action of the Hanoi Towers group on the levels of the rooted ternary tree. The spectrum of the limiting graph (Schreir graph of the action o...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملRational Tree Morphisms and Transducer Integer Sequences: Definition and Examples
The notion of transducer integer sequences is considered through a series of examples (the chosen examples are related to the Tower of Hanoi problem on 3 pegs). By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite transducers encoding rational tree morphisms (length and prefix preserving transformations of words that have only fi...
متن کاملBrain Activation in the Prefrontal Cortex during Motor and Cognitive Tasks in Adults
The prefrontal cortex (PFC) plays an important role in cognitive function, involved in Executive Functions (EFs) such as planning, working memory, and inhibition. Activation in the PFC also occurs during some motor activities. One commonly used tool to assess EF is the Tower of Hanoi, demonstrating sensitivity to PFC dysfunction. However, limited neuroimaging evidence is available to support th...
متن کامل